منابع مشابه
Lexicographic composition of simple games
A two-house legislature can often be modelled as a proper simple game whose outcome depends on whether a coalition wins, blocks or loses in two smaller proper simple games. It is shown that there are exactly ve ways to combine the smaller games into a larger one. This paper focuses on one of the rules, lexicographic composition, where a coalition wins in G1 ) G2 when it either wins in G1, or b...
متن کاملLexicographic Composition of Fuzzy Orderings
The present paper introduces an approach to construct lexicographic compositions of similarity-based fuzzy orderings. This construction is demonstrated by means of non-trivial examples. As this is a crucial feature of lexicographic composition, the preservation of linearity is studied in detail. We obtain once again that it is essential for meaningful results that the t-norm under consideration...
متن کاملA simple lexicographic ranker and probability estimator
Given a binary classification task, a ranker is an algorithm that can sort a set of instances from highest to lowest expectation that the instance is positive. We propose a lexicographic ranker, LexRank , whose rankings are derived not from scores, but from a simple ranking of attribute values obtained from the training data. We show that by using the odds ratio to rank the attribute values we ...
متن کاملA Simple Lexicographic Ranker and Probability Estimator
Given a binary classification task, a ranker sorts a set of instances from highest to lowest expectation that the instance is positive. We propose a lexicographic ranker, LexRank , whose rankings are derived not from scores, but from a simple ranking of attribute values obtained from the training data. When using the odds ratio to rank the attribute values we obtain a restricted version of the ...
متن کاملNash Equilibria in Concurrent Games with Lexicographic Preferences
We study concurrent games with finite-memory strategies where players are given a Büchi and a mean-payoff objective, which are related by a lexicographic order: a player first prefers to satisfy its Büchi objective, and then prefers to minimise costs, which are given by a mean-payoff function. In particular, we show that deciding the existence of a strict Nash equilibrium in such games is decid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Games and Economic Behavior
سال: 2008
ISSN: 0899-8256
DOI: 10.1016/j.geb.2007.06.005